0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n025.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Thu Jul  4 06:00:39 EDT 2024
0.13/0.34	% CPUTime    : 
0.21/0.49	Running higher-order theorem proving
0.21/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.dBxiFM4PzT/E---3.1_15112.p
0.21/0.51	# Version: 3.2.0-ho
0.21/0.51	# Preprocessing class: HSSSSMSSSSSCHHA.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.51	# Starting ho_unfolding_6 with 900s (5) cores
0.21/0.51	# Starting ehoh_best_sine with 180s (1) cores
0.21/0.51	# Starting ehoh_best_nonlift with 180s (1) cores
0.21/0.51	# Starting lpo4_lambdas_fix with 180s (1) cores
0.21/0.51	# ehoh_best_sine with pid 15194 completed with status 0
0.21/0.51	# Result found by ehoh_best_sine
0.21/0.51	# Preprocessing class: HSSSSMSSSSSCHHA.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.51	# Starting ho_unfolding_6 with 900s (5) cores
0.21/0.51	# Starting ehoh_best_sine with 180s (1) cores
0.21/0.51	# SinE strategy is gf500_gu_R04_F100_L20000
0.21/0.51	# Search class: HHUNF-FFSF00-SHHFFMBC
0.21/0.51	# partial match(2): HGUNF-FFSF00-SHHFFMBN
0.21/0.51	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.21/0.51	# Starting ehoh_best6_lambda with 109s (1) cores
0.21/0.51	# ehoh_best6_lambda with pid 15197 completed with status 0
0.21/0.51	# Result found by ehoh_best6_lambda
0.21/0.51	# Preprocessing class: HSSSSMSSSSSCHHA.
0.21/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.51	# Starting ho_unfolding_6 with 900s (5) cores
0.21/0.51	# Starting ehoh_best_sine with 180s (1) cores
0.21/0.51	# SinE strategy is gf500_gu_R04_F100_L20000
0.21/0.51	# Search class: HHUNF-FFSF00-SHHFFMBC
0.21/0.51	# partial match(2): HGUNF-FFSF00-SHHFFMBN
0.21/0.51	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.21/0.51	# Starting ehoh_best6_lambda with 109s (1) cores
0.21/0.51	# Preprocessing time       : 0.001 s
0.21/0.51	# Presaturation interreduction done
0.21/0.51	
0.21/0.51	# Proof found!
0.21/0.51	# SZS status Theorem
0.21/0.51	# SZS output start CNFRefutation
0.21/0.51	thf(decl_22, type, epso: ($o > $o) > $o).
0.21/0.51	thf(decl_23, type, epsoo: (($o > $o) > $o) > $o > $o).
0.21/0.51	thf(choiceaxo, axiom, ![X1:$o > $o]:(((X1 @ ((epso @ X1)))<=?[X2:$o]:((X1 @ ((X2)))))), file('/export/starexec/sandbox/tmp/tmp.dBxiFM4PzT/E---3.1_15112.p', choiceaxo)).
0.21/0.51	thf(c, conjecture, ((epsoo @ epso @ (~($true)))=>(epsoo @ epso @ (($true)))), file('/export/starexec/sandbox/tmp/tmp.dBxiFM4PzT/E---3.1_15112.p', c)).
0.21/0.51	thf(choiceaxoo, axiom, ![X3:($o > $o) > $o]:(((X3 @ (epsoo @ X3))<=?[X4:$o > $o]:((X3 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.dBxiFM4PzT/E---3.1_15112.p', choiceaxoo)).
0.21/0.51	thf(c_0_3, plain, ![X1:$o > $o]:((?[X2:$o]:((X1 @ ((X2))))=>(X1 @ ((epso @ X1))))), inference(fof_simplification,[status(thm)],[choiceaxo])).
0.21/0.51	thf(c_0_4, plain, ![X11:$o > $o, X12:$o]:((~(X11 @ ((X12)))|(X11 @ ((epso @ X11))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
0.21/0.51	thf(c_0_5, negated_conjecture, ~((((~(~($true))|(epsoo @ epso @ $true))&(~($true)|(epsoo @ epso @ $false)))=>(epsoo @ epso @ $true))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[c])])).
0.21/0.51	thf(c_0_6, plain, ![X3:($o > $o) > $o]:((?[X4:$o > $o]:((X3 @ X4))=>(X3 @ (epsoo @ X3)))), inference(fof_simplification,[status(thm)],[choiceaxoo])).
0.21/0.51	thf(c_0_7, plain, ![X1:$o > $o, X2:$o]:(((X1 @ ((epso @ X1)))|~((X1 @ ((X2)))))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.21/0.51	thf(c_0_8, negated_conjecture, (((($true)|(epsoo @ epso @ $true))&(~($true)|(epsoo @ epso @ $false)))&~(epsoo @ epso @ $true)), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])).
0.21/0.51	thf(c_0_9, plain, ![X9:($o > $o) > $o, X10:$o > $o]:((~(X9 @ X10)|(X9 @ (epsoo @ X9)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
0.21/0.51	thf(c_0_10, plain, ~((epso @ $not)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])])])).
0.21/0.51	thf(c_0_11, negated_conjecture, ((epsoo @ epso @ (~($true)))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.51	thf(c_0_12, plain, ![X3:($o > $o) > $o, X1:$o > $o]:(((X3 @ (epsoo @ X3))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.21/0.51	thf(c_0_13, plain, (epso @ (^[Z0/* 3 */:$o]:((Z0)))), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]), c_0_10, c_0_7])])])).
0.21/0.51	thf(c_0_14, negated_conjecture, (epsoo @ epso @ (~($true))), inference(cn,[status(thm)],[c_0_11])).
0.21/0.51	thf(c_0_15, plain, (epso @ (epsoo @ epso)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.21/0.51	thf(c_0_16, negated_conjecture, ~((epsoo @ epso @ (($true)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.21/0.51	thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_14]), c_0_15]), c_0_16]), ['proof']).
0.21/0.51	# SZS output end CNFRefutation
0.21/0.51	# Parsed axioms                        : 5
0.21/0.51	# Removed by relevancy pruning/SinE    : 2
0.21/0.51	# Initial clauses                      : 5
0.21/0.51	# Removed in clause preprocessing      : 1
0.21/0.51	# Initial clauses in saturation        : 4
0.21/0.51	# Processed clauses                    : 13
0.21/0.51	# ...of these trivial                  : 0
0.21/0.51	# ...subsumed                          : 1
0.21/0.51	# ...remaining for further processing  : 11
0.21/0.51	# Other redundant clauses eliminated   : 1
0.21/0.51	# Clauses deleted for lack of memory   : 0
0.21/0.51	# Backward-subsumed                    : 0
0.21/0.51	# Backward-rewritten                   : 0
0.21/0.51	# Generated clauses                    : 20
0.21/0.51	# ...of the previous two non-redundant : 13
0.21/0.51	# ...aggressively subsumed             : 0
0.21/0.51	# Contextual simplify-reflections      : 0
0.21/0.51	# Paramodulations                      : 3
0.21/0.51	# Factorizations                       : 0
0.21/0.51	# NegExts                              : 0
0.21/0.51	# Equation resolutions                 : 1
0.21/0.51	# Disequality decompositions           : 0
0.21/0.51	# Total rewrite steps                  : 2
0.21/0.51	# ...of those cached                   : 1
0.21/0.51	# Propositional unsat checks           : 0
0.21/0.51	#    Propositional check models        : 0
0.21/0.51	#    Propositional check unsatisfiable : 0
0.21/0.51	#    Propositional clauses             : 0
0.21/0.51	#    Propositional clauses after purity: 0
0.21/0.51	#    Propositional unsat core size     : 0
0.21/0.51	#    Propositional preprocessing time  : 0.000
0.21/0.51	#    Propositional encoding time       : 0.000
0.21/0.51	#    Propositional solver time         : 0.000
0.21/0.51	#    Success case prop preproc time    : 0.000
0.21/0.51	#    Success case prop encoding time   : 0.000
0.21/0.51	#    Success case prop solver time     : 0.000
0.21/0.51	# Current number of processed clauses  : 7
0.21/0.51	#    Positive orientable unit clauses  : 3
0.21/0.51	#    Positive unorientable unit clauses: 0
0.21/0.51	#    Negative unit clauses             : 2
0.21/0.51	#    Non-unit-clauses                  : 2
0.21/0.51	# Current number of unprocessed clauses: 8
0.21/0.51	# ...number of literals in the above   : 14
0.21/0.51	# Current number of archived formulas  : 0
0.21/0.51	# Current number of archived clauses   : 4
0.21/0.51	# Clause-clause subsumption calls (NU) : 0
0.21/0.51	# Rec. Clause-clause subsumption calls : 0
0.21/0.51	# Non-unit clause-clause subsumptions  : 0
0.21/0.51	# Unit Clause-clause subsumption calls : 0
0.21/0.51	# Rewrite failures with RHS unbound    : 0
0.21/0.51	# BW rewrite match attempts            : 0
0.21/0.51	# BW rewrite match successes           : 0
0.21/0.51	# Condensation attempts                : 0
0.21/0.51	# Condensation successes               : 0
0.21/0.51	# Termbank termtop insertions          : 779
0.21/0.51	# Search garbage collected termcells   : 99
0.21/0.51	
0.21/0.51	# -------------------------------------------------
0.21/0.51	# User time                : 0.006 s
0.21/0.51	# System time              : 0.001 s
0.21/0.51	# Total time               : 0.007 s
0.21/0.51	# Maximum resident set size: 1808 pages
0.21/0.51	
0.21/0.51	# -------------------------------------------------
0.21/0.51	# User time                : 0.007 s
0.21/0.51	# System time              : 0.003 s
0.21/0.51	# Total time               : 0.010 s
0.21/0.51	# Maximum resident set size: 1720 pages
0.21/0.51	% E---3.1 exiting
0.21/0.51	% E exiting
0.21/0.51	EOF